An Activity Rule Based Approach to Simulate ADL Sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Anatomy-based Approach to Simulate the Temporomandibular Joint Movement

Besides enhancing the realism of the animation of virtual humans, the simulation of joints has become an important tool to help medical diagnosis and estimation of post-procedures results, thus simplifying and improving surgery planning. However, to be effective both in diagnosis and treatment planning, one needs to model the joints being analyzed according to the patient characteristics. This ...

متن کامل

An Approach to Rule-Based Knowledge Extraction

The extraction of easily interpretable knowledge from the large amount of data measured in experiments is well desirable. This paper proposes a method to achieve this. A fuzzy rule system isjirst generated and optimized using evolution strategies. This fuzzy system is then converted to an RBF neural network to reJine the obtained knowledge. In order to extract understandable fuzzy rules from th...

متن کامل

An Activity Language for the ADL Toolkit

Over the past decade numerous architecture description languages (ADLs) and tools have been developed [2]. Each has certain strengths, and each tends to work in isolation. A desirable goal is to find ways to combine the capabilities so that new architecture development environments can be easily developed by combining existing building blocks for architectural description, analysis, code genera...

متن کامل

Analysis of Noun-Noun sequences: a rule based approach

This paper reports on work in progress to improve shallow parsing for Basque. The practical goal of our work is to enrich the information of the shallow parser with linguistic information for analyzing sequences containing an N that instantiates a kind of quantification of the other nominal constituent, by means of some different syntactical structures.

متن کامل

Rule based lexicographical permutation sequences

In a permutation sequence built by means of sub permutations, the transitions between successive permutations are subject to a set of n(n – 1)/2 rules that naturally group into n – 1 matrices with a high degree of regularity. By means of these rules, the sequence can be produced in O(3n!) time and O(n) space. To generate all permutations of a given set one can go for (among other things) a mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2018

ISSN: 2169-3536

DOI: 10.1109/access.2018.2807761